Bounds for sets with few distances distinct modulo a prime ideal
نویسندگان
چکیده
Let
منابع مشابه
Bounds on sets with few distances
We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered: • we improve the Ray-Chaudhuri–Wilson bound of the size of uniform intersecting families of subsets; • we refine the bound of Delsarte-Goethals-Seidel on the maximum size of spherical sets with few distances; • we prove a new bound on codes with few dista...
متن کاملSets with few distinct distances do not have heavy lines
Let P be a set of n points in the plane that determines at most n/5 distinct distances. We show that no line can contain more than O(npolylog(n)) points of P . We also show a similar result for rectangular distances, equivalent to distances in the Minkowski plane, where the distance between a pair of points is the area of the axis-parallel rectangle that they span. The problem and its backgroun...
متن کاملAffine-evasive Sets Modulo a Prime
In this work, we describe a simple and efficient construction of a large subset S of Fp , where p is a prime, such that the set A(S) for any non-identity affine map A over Fp has small intersection with S . Such sets, called affine-evasive sets, were defined and constructed in [ADL14] as the central step in the construction of non-malleable codes against affine tampering over Fp , for a prime p...
متن کاملAdding distinct congruence classes modulo a prime
The Cauchy-Davenport theorem states that if A and B are nonempty sets of congruence classes modulo a prime p, and if |A| = k and |B| = l, then the sumset A + B contains at least min(p, k + l − 1) congruence classes. It follows that the sumset 2A contains at least min(p, 2k − 1) congruence classes. Erdős and Heilbronn conjectured 30 years ago that there are at least min(p, 2k − 3) congruence cla...
متن کاملBisector Energy and Few Distinct Distances
We introduce the bisector energy of an n-point set P in R2, defined as E(P) = ∣∣{(a, b, c, d) ∈ P | a, b have the same perpendicular bisector as c, d}∣∣ . If no line or circle contains M(n) points of P, then we prove that for any ε > 0 E(P) = O ( M(n) 2 5n 12 5 +ε +M(n)n ) . We also derive the lower bound E(P) = Ω(M(n)n2), which matches our upper bound when M(n) is large. We use our upper bound...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebraic combinatorics
سال: 2023
ISSN: ['2589-5486']
DOI: https://doi.org/10.5802/alco.272